Properties of the longest-edge n-section refinement scheme for triangular meshes

نویسندگان

  • José P. Suárez
  • Tania Moreno
  • Pilar Abad
  • Angel Plaza
چکیده

The stability condition or non-degeneracy property means that the interior angles of all elements have to be bounded uniformly away from zero. Non-degeneracy is essential, for example, for the approximation properties of finite element spaces and the convergence behavior of multigrid and multilevel algorithms. Rosenberg and Stenger [1] showed the non-degeneracy property for LE-bisection: if α0 is the minimum angle of initial given triangle, and αk is the minimum interior angle in new triangles appeared at iteration k, then αk > α0/2. A similar bound has been obtained recently for the LE-trisection: αk > α0/c where c = π/3 arctan( √ 3 11 ) [2]. Theorem 1. The iterative application of longest-edge n-section when n > 4 to a given arbitrary triangle △ABC generates a sequence of new triangles in which limk→∞ αk = 0, αk being the minimum triangle angle in iteration k. Proof. It is enough to prove that there exists a sequence {τk}∞k=0 such that: (1) τk is the value of the interior angle obtained after kth iteration of the LE n-section of the given triangle △ABC . (2) limk→∞ τk = 0. In fact, for all k > 1 we have αk 6 τk, then: 0 6 limk→∞ αk 6 limk→∞ τk = 0, where, clearly, limk→∞ αk = 0. We now prove that there exists such a sequence {τk}∞k=0. Let n > 4 and △ABC be an arbitrary triangle with sides |AB| 6 |AC | 6 |BC |. We consider a triangle sequence {∆k}∞k=0 such that ∆0 = △A0B0C0, A0 = A, B0 = B, C0 = C . For all k > 0 let ∆k+1 = △Ak+1Bk+1Ck+1 where Ak+1 ∈ BkCk such that |Ak+1Ck| = n |BkCk|, Bk+1 = Ck and Ck+1 = Ak. It should be noted that for all k > 1, |AkBk| 6 |AkCk| < |BkCk| and that ∆k is one of the triangles generated by applying the LE n-section to triangle ∆k−1. ∗ Correspondence to: University of Las Palmas de Gran Canaria, Escuela de Ingenierías Industriales y Civiles, 35017-Las Palmas de Gran Canaria, Spain. Tel.: +34 928 45 72 68; fax: +34 928 45 18 72. E-mail address: [email protected] (J.P. Suárez). 0893-9659/$ – see front matter© 2012 Elsevier Ltd. All rights reserved. doi:10.1016/j.aml.2012.04.014 2038 J.P. Suárez et al. / Applied Mathematics Letters 25 (2012) 2037–2039 Fig. 1. Scheme for the constructed triangle sequence in the LE n-section.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A new proof of the degeneracy property of the longest-edge n-section refinement scheme for triangular meshes

In this note, by using complex variable functions, we present a new simpler proof of the degeneracy property of the longest-edge n-section of triangles for n P 4. This means that the longest-edge n-section of triangles for n P 4 produces a sequence of triangles with minimum interior angle converging to zero. 2012 Elsevier Inc. All rights reserved.

متن کامل

Two-sided estimation of diameters reduction rate for the longest edge n-section of triangles with 4 n

In this work we study the diameters reduction rate for the iterative application of the longest edge (LE) n-section of triangles for n P 4. The maximum diameter dnk of all triangles generated at the kth iteration of the LE n-section is closely connected with the properties of the triangular mesh generated by this refinement scheme. The upper and the lower bounds for d2k were proved by Kearfott ...

متن کامل

Geometric Properties of the Local Refinement in Unstructured Triangular Meshes

In this work we study the propagation problem due to the conformity process in the longestedge based refinement algorithms for triangular unstructured meshes. The geometric properties in study answers the important question of how the size of the triangulation is affected when local refinement is applied. We prove both theoretically and empirically that the propagation of a single triangle refi...

متن کامل

A local refinement algorithm for the longest-edge trisection of triangle meshes

In this paper we present a local refinement algorithm based on the longest-edge trisection of triangles. Local trisection patterns are sed to generate a conforming triangulation, depending on the number of non-conforming nodes per edge presented. We describe he algorithm and provide a study of the efficiency (cost analysis) of the triangulation refinement problem. The algorithm presented, nd it...

متن کامل

Convergence of Longest Edge n-Section of Triangles

Let t be a triangle in R. We find the Longest Edge (LE) of t, insert n−1 equally-space points in the LE and connect them to the opposite vertex. This yields the generation of n new sub-triangles whose parent is t. Now, continue this process iteratively. Proficient algorithms for mesh refinement using this method are known when n = 2, but less known when n = 3 and completely unknown when n > 4. ...

متن کامل

Recursive Tetrahedral Meshes for Scientific Visualization

The advent of high-performance computing has completely transformed the nature of most scientific and engineering disciplines, making the study of complex problems from experimental and theoretical disciplines computationally feasible. All science and engineering disciplines are facing the same problem: how to archive, transmit, visualize, and explore the massive data sets resulting from modern...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Appl. Math. Lett.

دوره 25  شماره 

صفحات  -

تاریخ انتشار 2012